Improved Techniques for Lower Bounds for Odd Perfect Numbers
نویسندگان
چکیده
If N is an odd perfect number, and q \\ N, q prime, k even, 2k then it is almost immediate that N > q .We prove here that, subject to certain conditions verifiable in polynomial time, in fact N > q ' . Using this and related results, we are able to extend the computations in an earlier paper to show that N > 10300 .
منابع مشابه
On the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملThe second largest prime divisor of an odd perfect number exceeds ten thousand
Let σ(n) denote the sum of positive divisors of the natural number n. Such a number is said to be perfect if σ(n) = 2n. It is well known that a number is even and perfect if and only if it has the form 2p−1(2p − 1) where 2p − 1 is prime. No odd perfect numbers are known, nor has any proof of their nonexistence ever been given. In the meantime, much work has been done in establishing conditions ...
متن کاملImproved approaches for investigation of small spherical designs
We strengthen previously applied polynomial techniques for investigation of spherical designs to obtain new bounds on inner products in some class of designs. This allows further improvements on the best known lower bounds for the minimum possible odd cardinality of designs of odd strength either in small dimensions and in certain asymptotic process.
متن کاملOdd perfect numbers, Diophantine equations, and upper bounds
We obtain a new upper bound for odd multiperfect numbers. If N is an odd perfect number with k distinct prime divisors and P is its largest prime divisor, we find as a corollary that 1012P 2N < 24 k . Using this new bound, and extensive computations, we derive the inequality k ≥ 10. Introduction One of the oldest unsolved problems in mathematics is whether there exists an odd perfect number N ....
متن کاملAn Upper Bound for Odd Perfect Numbers
If N is an odd perfect number with k distinct prime factors then we show that N < 2 k . If some of the small prime factors of N are known then this bound can be further improved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999